1966C - Everything Nim - CodeForces Solution


games greedy

Please click on ads to support us..

Python Code:

for i in range(int(input())):
    n = int(input())
    vals = list(map(int, input().split()))
    vals = sorted(set(vals))
    ans = 'not found yet'
    for j in range(len(vals)):
        if vals[j] != j+1:
            if (j+1) % 2 == 0:
                ans = 'Bob'
            else:
                ans = 'Alice'
            break
    if ans == 'not found yet':
        if len(vals) % 2 == 0:
            ans = 'Bob'
        else: ans = 'Alice'
    print(ans)


Comments

Submit
0 Comments
More Questions

1717B - Madoka and Underground Competitions
61B - Hard Work
959B - Mahmoud and Ehab and the message
802G - Fake News (easy)
1717C - Madoka and Formal Statement
420A - Start Up
1031A - Golden Plate
1559C - Mocha and Hiking
427B - Prison Transfer
330A - Cakeminator
426A - Sereja and Mugs
363A - Soroban
1585C - Minimize Distance
1506E - Restoring the Permutation
1539A - Contest Start
363D - Renting Bikes
1198D - Rectangle Painting 1
1023B - Pair of Toys
1725A - Accumulation of Dominoes
1675E - Replace With the Previous Minimize
839A - Arya and Bran
16B - Burglar and Matches
1625B - Elementary Particles
1725G - Garage
1725B - Basketball Together
735A - Ostap and Grasshopper
1183B - Equalize Prices
1481A - Space Navigation
1437B - Reverse Binary Strings
1362B - Johnny and His Hobbies